Heat kernel and essential spectrum of infinite graphs
نویسندگان
چکیده
منابع مشابه
Heat kernel analysis on graphs
In this thesis we aim to develop a framework for graph characterization by combining the methods from spectral graph theory and manifold learning theory. The algorithms are applied to graph clustering, graph matching and object recognition. Spectral graph theory has been widely applied in areas such as image recognition, image segmentation, motion tracking, image matching and etc. The heat kern...
متن کاملHeat Kernel Analysis on Infinite-dimensional Groups
The paper gives an overview of our previous results concerning heat kernel measures in infinite dimensions. We give a history of the subject first, and then describe the construction of heat kernel measure for a class of infinite-dimensional groups. The main tool we use is the theory of stochastic differential equations in infinite dimensions. We provide examples of groups to which our results ...
متن کاملHeat kernel measures and Riemannian geometry on infinite-dimensional groups
I will describe a construction of heat kernel measures on GL(H), the group of invertible operators on a complex Hilbert space H. This measure is determined by an infinite dimensional Lie algebra g and a Hermitian inner product on it. The main tool in this construction is a diffusion in a Hilbert space ambient g. Then I’ll describe holomorphic functions and their properties. One of interesting n...
متن کاملHeat kernel estimates on weighted graphs
We prove upper and lower heat kernel bounds for the Laplacian on weighted graphs which include the case that the weights have no strictly positive lower bound. Our estimates allow for a very explicit probabilistic interpretation and can be formulated in terms of a weighted metric. Interestingly, this metric is not equivalent to the intrinsic metric. The results Heat kernel estimates are a tool ...
متن کاملCharacterising Graphs using the Heat Kernel
The heat-kernel of a graph is computed by exponentiating the Laplacian eigen-system with time. In this paper, we study the heat kernel mapping of the nodes of a graph into a vector-space. Specifically, we investigate whether the resulting point distribution can be used for the purposes of graphclustering. Our characterisation is based on the covariance matrix of the point distribution. We explo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 2009
ISSN: 0022-2518
DOI: 10.1512/iumj.2009.58.3575